Stable super-resolution limit and smallest singular value of restricted Fourier matrices

نویسندگان

چکیده

We consider the inverse problem of recovering locations and amplitudes a collection point sources represented as discrete measure, given M+1 its noisy low-frequency Fourier coefficients. Super-resolution refers to stable recovery when distance Δ between two closest is less than 1/M. introduce clumps model where are closely spaced within several clumps. Under this assumption, we derive non-asymptotic lower bound for minimum singular value Vandermonde matrix whose nodes determined by sources. Our estimate weighted ℓ2 sum, each term only depends on configuration individual clump. The main novelty that our obtains an exact dependence Super-Resolution Factor SRF=(MΔ)−1. As noise level increases, sensitivity noise-space correlation function in MUSIC algorithm degrades according power law SRF exponent cardinality largest Numerical experiments validate theoretical bounds MUSIC. also provide upper min-max error super-resolution grid model, which turn related matrices.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stable super-resolution limit and smallest singular value of restricted Fourier matrices

For many imaging tasks, it is necessary to locate a small number of point sources with high precision from their noisy low frequency Fourier coefficients. When the point sources are located on a fine grid, this problem is equivalent to recovering a N -dimensional S-sparse complex vector from noisy observations of its first M discrete Fourier coefficients, where N M and the noise level is bounde...

متن کامل

Singular value inequalities for positive semidefinite matrices

In this note‎, ‎we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique‎. ‎Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl‎. ‎308 (2000) 203-211] and [Linear Algebra Appl‎. ‎428 (2008) 2177-2191]‎.

متن کامل

Smallest singular value of random matrices and geometry of random polytopes

We study behaviour of the smallest singular value of a rectangular random matrix, i.e., matrix whose entries are independent random variables satisfying some additional conditions. We prove a deviation inequality and show that such a matrix is a “good” isomorphism on its image. Then we obtain asymptotically sharp estimates for volumes and other geometric parameters of random polytopes (absolute...

متن کامل

On generic chaining and the smallest singular value of random matrices with heavy tails

We present a very general chaining method which allows one to control the supremum of the empirical process suph∈H |N−1 ∑N i=1 h (Xi)− Eh2| in rather general situations. We use this method to establish two main results. First, a quantitative (non asymptotic) version of the classical Bai-Yin Theorem on the singular values of a random matrix with i.i.d entries that have heavy tails, and second, a...

متن کامل

Lower Bounds for the Smallest Singular Value of Structured Random Matrices

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider n× n matrices with complex entries of the form M = A ◦X +B = (aijξij + bij) where X = (ξij) has iid centered entries of unit variance and A and B are fixed matrices. In our main result we obtain polynomial bounds on the smallest si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied and Computational Harmonic Analysis

سال: 2021

ISSN: ['1096-603X', '1063-5203']

DOI: https://doi.org/10.1016/j.acha.2020.10.004